Semi-Decentralized Generalized Nash Equilibrium Seeking in Monotone Aggregative Games

We address the generalized Nash equilibrium seeking problem for a population of agents playing aggregative games with affine coupling constraints. focus on semi-decentralized communication architectures, where there is central coordinator able to gather and broadcast signals nature agents. By exploiting framework monotone operator theory splitting, we first critically review most relevant available algorithms then design two novel schemes: 1) single-layer, fixed-step algorithm convergence guarantee general (noncocoercive, nonstrictly) 2) single-layer proximal-type class linearly coupled cost functions. also accelerated variants via (alternating) inertial over-relaxation steps. Finally, show numerical simulations that proposed outperform those in literature terms speed.